Inherent complexity trade-offs for range query problems
نویسندگان
چکیده
منابع مشابه
Query Time Versus Redundancy Trade-Offs for Range Queries
Let A(l),A(2),...,A(n) be an array which stores values in a commutative semi-group S. We are concerned with the design of data structures for representing the array A(i) which facilitate implementation of the range queries Retrieve(j, k) defined as follows. Retrieve(j, k) (l<j<k&n) Return i A(i). i=j An obvious data structure would be the array A(j) itself. This approach has the disadvantage th...
متن کاملTime-Approximation Trade-offs for Inapproximable Problems
In this paper we focus on problems which do not admit a constant-factor approximation in polynomial time and explore how quickly their approximability improves as the allowed running time is gradually increased from polynomial to (sub-)exponential. We tackle a number of problems: For Min Independent Dominating Set, Max Induced Path, Forest and Tree, for any r(n), a simple, known scheme gives an...
متن کاملInherent Trade-Offs in the Fair Determination of Risk Scores
Recent discussion in the public sphere about algorithmic classification has involved tension between competing notions of what it means for a probabilistic classification to be fair to different groups. We formalize three fairness conditions that lie at the heart of these debates, and we prove that except in highly constrained special cases, there is no method that can satisfy these three condi...
متن کاملAcknowledging conservation trade-offs and embracing complexity.
There is a growing recognition that conservation often entails trade-offs. A focus on trade-offs can open the way to more complete consideration of the variety of positive and negative effects associated with conservation initiatives. In analyzing and working through conservation trade-offs, however, it is important to embrace the complexities inherent in the social context of conservation. In ...
متن کاملFunctional complexity can mitigate performance trade-offs.
Trade-offs are believed to impose major constraints on adaptive evolution, and they arise when modification of a trait improves one aspect of performance but incurs a cost in another. Here we show that performance costs that result from competing demands on one trait can be mitigated by compensatory changes in other traits, so long as performance has a complex basis. Numerical simulations indic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1981
ISSN: 0304-3975
DOI: 10.1016/0304-3975(81)90099-2